Feature Selection using Simulated Annealing with Optimal Neighborhood Approach

نویسندگان

چکیده

Abstract The one of the metaheuristic approaches that can be used was simulated annealing (SA) algorithm which inspired by metallurgical process. This shows advantages in finding global optimum given function will feature selection. In this study, we trying to combine neighborhood size and limited approach using data simulation comparing between two is Akaike Index Criterion (AIC) Bayesian (BIC) function. result experiment selected variables optimal limit variable provide goodness model around 98% accuracy specificity 94% sensitivity compared with algorithms without any modification both AIC BIC function, also give better than

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the Neighborhood Selection Strategy in Simulated Annealing using the Optimal Stopping Problem

Simulated Annealing is one the most well known local search methods. In practice, it is often used to solve discrete optimization problems; especially very tough problems, [54, 37, 34, 3, 2, 41]. Global optimization is computationally extremely challenging and for large instances, exact methods reach their limitations quickly. Hence, in practice, often local optimization methods are used. Simul...

متن کامل

Simulated Annealing with Advanced Adaptive Neighborhood

It was Kirkpatrick et al. who first proposed simulated annealing, SA, as a method for solving combinatorial optimization problems[1]. It is reported that SA is very useful for several types of combinatorial optimization problems[2]. The advantages and the disadvantages of SA are well summarized in [3]. The most remarkable disadvantages are that it needs a lot of time to find the optimum solutio...

متن کامل

Temperature Parallel Simulated Annealing with Adaptive Neighborhood

In this paper, a Temperature Parallel Simulated Annealing with Adaptive Neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rate...

متن کامل

Parameter determination of support vector machine and feature selection using simulated annealing approach

Support vector machine (SVM) is a novel pattern classification method that is valuable in many applications. Kernel parameter setting in the SVM training process, along with the feature selection, significantly affects classification accuracy. The objective of this study is to obtain the better parameter values while also finding a subset of features that does not degrade the SVM classification...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of physics

سال: 2021

ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']

DOI: https://doi.org/10.1088/1742-6596/1752/1/012030